Zipfian and Lotkaian continuous concentration theory

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Zipfian and Lotkaian

This paper studies concentration (i.e. inequality) aspects of the functions of Zipf and of Lotka. Since both functions are power laws (i.e. they are – mathematically the same) it suffices to develop one concentration theory for power laws and apply it twice for the different interpretations of the laws of Zipf and Lotka. After a brief repetition of the functional relationships between Zipf’s la...

متن کامل

Zipfian discrimination

This talk outlines how form variation can be modelled in terms of equilibria between two dominant communicative pressures. The pressure to discriminate forms of a language enhances differences between expressions. Unchecked, this pressure can in principle lead to suppletion of the kind reported in languages such as Yélî Dnye (Henderson ). However, in most languages, the pressure towardsmaxi...

متن کامل

The Theory of Concentration Oligopoly

This paper originates the theory of buyer concentration for a main raw material input for a single processing industry. The Oligopsony concentration is obtained and subsequently decomposed into several factors, affecting indirectly the industry’s profitability. It is found that the leading firms’ efficiencies hypothesis is reaffirmed due to variations associated with the marginal productivity d...

متن کامل

Lotkaian informetrics and applications to social networks

Two-dimensional informetrics is defined in the general context of sources that produce items and examples are given. These systems are called “Information Production Processes” (IPPs). They can be described by a size-frequency function f or, equivalently, by a rank-frequency function g. If f is a decreasing power law then we say that this function is the law of Lotka and it is equivalent with t...

متن کامل

Zipfian corruptions for robust POS tagging

Inspired by robust generalization and adversarial learning we describe a novel approach to learning structured perceptrons for part-ofspeech (POS) tagging that is less sensitive to domain shifts. The objective of our method is to minimize average loss under random distribution shifts. We restrict the possible target distributions to mixtures of the source distribution and random Zipfian distrib...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the American Society for Information Science and Technology

سال: 2005

ISSN: 1532-2882,1532-2890

DOI: 10.1002/asi.20186